A fast algorithm for strongly correlated knapsack problems
نویسندگان
چکیده
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملA branch-and-bound algorithm for hard multiple knapsack problems
The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, branch-and-bound algorithm. In this paper, we propose path-symmetry and path-dominance criteria for pruning nodes in the MKP branch-and-bound search space. In addition, we integrate the “bound-and-bound” upper bound validation t...
متن کاملFast and Scalable Parallel Algorithms for Knapsack-like Problems
We present two new algorithms for searching in sorted X+Y +R+S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 logn) (n being the size of the sorted arrays X, Y , R and S). Hence in each case, by constructing arrays of size n = O(2 s=4), we obtain a new algorithm for solving certain NP-Complete problems such as Knapsack on s data items in time equal (up ...
متن کاملA FAST FUZZY-TUNED MULTI-OBJECTIVE OPTIMIZATION FOR SIZING PROBLEMS
The most recent approaches of multi-objective optimization constitute application of meta-heuristic algorithms for which, parameter tuning is still a challenge. The present work hybridizes swarm intelligence with fuzzy operators to extend crisp values of the main control parameters into especial fuzzy sets that are constructed based on a number of prescribed facts. Such parameter-less particle ...
متن کاملA FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS
Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00127-9